well-ordered set
noun
,
Mathematics
1.
a totally ordered set in which every nonempty subset has a smallest element with the property that there is no element in the subset less than this smallest element.
Compare
partially ordered set
,
totally ordered set
.